Solving curing-protocol-dependent shape errors in PDMS replication
نویسندگان
چکیده
Abstract PolyDiMethylSiloxane (PDMS) is an elastomer increasingly used to produce soft objects by replication, in a variety of fields including electronics, microfluidics, tribology, biomechanics and robotics. While PDMS replication usually considered faithful at all scales, down nanoscales, detailed quantitative comparisons between the geometric features mold replicated object are still required further ground this commonly accepted view. Here, we show that top surface centimetric parallelepipedic blocks, molded on rigid plate, deviates from its expected flatness, amplitude deviation being dependent crosslinking protocol. As practical solution, identify suitable two-steps protocol which eliminates those errors. Using finite element simulations, effect originates thermal contraction when sample cools curing temperature operating temperature. This phenomenon actually applies any length scale, finely depends sample’s aspect ratio boundary conditions. Our results should help mitigating errors applications where well-defined geometry required.
منابع مشابه
Comparing Shape and Temporal PDMs
The Point Distribution Model (PDM) has been successfully used in representing sets of static and moving images. A recent extension to the PDM for moving objects, the temporal PDM, has been proposed. This utilises quantities such as velocity and acceleration to more explicitly consider the characteristics of the movement and the sequencing of the changes in shape that occur. This research aims t...
متن کاملPost-completion Errors in Problem Solving
A post-completion error is a specific form of omission error occurring after some task goal has been accomplished – for example, forgetting to collect your original after photocopying. Using a novel experimental paradigm, this study demonstrates the cognitive robustness of postcompletion error: that it occurs not only in routine procedural tasks but also in problem-solving situations. The effec...
متن کاملRounding errors in solving block Hessenberg systems
A rounding error analysis is presented for a divide-and-conquer algorithm to solve linear systems with block Hessenberg matrices. Conditions are derived under which the algorithm computes a stable solution. The algorithm is shown to be stable for block diagonally dominant matrices and for M-matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Micromechanics and Microengineering
سال: 2022
ISSN: ['1361-6439', '0960-1317']
DOI: https://doi.org/10.1088/1361-6439/ac56ea